Evolving DPA-Resistant Boolean Functions

نویسندگان

  • Stjepan Picek
  • Lejla Batina
  • Domagoj Jakobovic
چکیده

Boolean functions are important primitives in cryptography. Accordingly, there exist numerous works on the methods of constructions of Boolean functions. However, the property specifying the resistance of Boolean functions against Differential Power Analysis (DPA) attacks was until now scarcely investigated and only for S-boxes. Here, we evolve Boolean functions that have higher resistance to DPA attacks than others published before by using two well-known evolutionary computation methods where genetic programming shows best performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault Analysis of DPA-Resistant Algorithms

In this paper several attacks are presented that allow information to be derived on faults injected at the beginning of cryptographic algorithm implementations that use Boolean masking to defend against Differential Power Analysis (DPA). These attacks target the initialisation functions that are used to enable the algorithm to be protected, allowing a fault attack even in the presence of round ...

متن کامل

DPA Attacks and S-Boxes

For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-boxes (also called (n, m)-functions) relied on DPA attacks. We show that these properties are opposite to the non-linearity criterion and to the propagation criterion. To quantify the resistance of an S-box to DPA atta...

متن کامل

Constrained Search for a Class of Good S-Boxes with Improved DPA Resistivity

Abstract. In FSE 2005, transparency order was proposed as a parameter for the robustness of S-boxes to Differential Power Analysis (DPA): lower transparency order implying more resistance. However most cryptographically strong Boolean functions have been found to have high transparency order. Also it is a difficult problem to search for Boolean functions which are strong cryptographically, and ...

متن کامل

Design of Low-Power DPA-Resistant Cryptographic Functional Units

A design methodology is proposed to implement instructionset extensions for cryptographic processors and hardware accelerators with the aim to improve their potential robustness against Differential Power Analysis (DPA) attacks. The approach has a high-level component that is based on identifying the critical units and functions in a design with respect to DPA resistance, and a gate-level compo...

متن کامل

A Sound Method for Switching between Boolean and Arithmetic Masking

Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations of cryptographic algorithms. In an attempt to reduce the resulting memory and execution time overhead, a general method was recently proposed, consisting in “masking” all the intermediate data. This masking strategy is possibl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014